翻訳と辞書
Words near each other
・ Semifinalists (album)
・ Semifissispora
・ Semifluxon
・ Semifonte
・ Semifreddi's Bakery
・ Semifreddo
・ Semifusa
・ Semigallia
・ Semigallian
・ Semigallian language
・ Semigallians
・ Semigraphics
・ Semigroup
・ Semigroup action
・ Semigroup Forum
Semigroup with involution
・ Semigroup with three elements
・ Semigroup with two elements
・ Semigroupoid
・ Semigyalecta
・ Semih
・ Semih Aydilek
・ Semih Erden
・ Semih Kaplanoğlu
・ Semih Kaya
・ Semih Sancar
・ Semih Saygıner
・ Semih Tezcan
・ Semih Tufan Gülaltay
・ Semih Yağcı


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Semigroup with involution : ウィキペディア英語版
Semigroup with involution
In mathematics, particularly in abstract algebra, a semigroup with involution or a
*-semigroup is a semigroup equipped with an involutive anti-automorphism, which—roughly speaking—brings it closer to a group because this involution, considered as unary operator, exhibits certain fundamental properties of the operation of taking the inverse in a group: uniqueness, double application "cancelling itself out", and the same interaction law with the binary operation as in the case of the group inverse. It is thus not a surprise that any group is a semigroup with involution. However there are significant natural examples of semigroups with involution that are not groups.
An example from linear algebra is the multiplicative monoid of real square matrices of order ''n'' (called the full linear monoid). The map which sends a matrix to its transpose is an involution because the transpose is well defined for any matrix and obeys the law (''AB'')''T'' = ''B''''T''''A''''T'' which has the same form of interaction with multiplication as taking inverses has in the general linear group (which is a subgroup of the full linear monoid). However, for an arbitrary matrix ''AA''''T'' does not equal the identity element (namely the diagonal matrix). Another example, coming from formal language theory, is the free semigroup generated by a nonempty set (an alphabet), with string concatenation as the binary operation, and the involution being the map which reverses the linear order of the letters in a string. A third example, from basic set theory, is the set of all binary relations between a set and itself, with the involution being the inverse relation, and the multiplication given by the usual composition of relations.
Semigroups with involution appeared explicitly named in a 1953 paper of Viktor Wagner (in Russian) as result of his attempt to bridge the theory of semigroups with that of semiheaps.
==Formal definition==
Let ''S'' be a semigroup with its binary operation written multiplicatively. An involution in ''S'' is a unary operation
* on ''S'' (or, a transformation
* : ''S'' → ''S'', ''x'' ↦ ''x''
*) satisfying the following conditions:
#For all ''x'' in ''S'', (''x''
*)
* = ''x''.
#For all ''x'', ''y'' in ''S'' we have (''xy'')
* = ''y''
*''x''
*.
The semigroup ''S'' with the involution
* is called a semigroup with involution.
Semigroups that satisfy only the first of these axioms belong to the larger class of U-semigroups.
In some applications, the second of these axioms has been called antidistributive. Regarding the natural philosophy of this axiom, H.S.M. Coxeter remarked that it "becomes clear when we think of () and () as the operations of putting on our socks and shoes, respectively."〔H.S.M. Coxeter, ''Introduction to Geometry'', p. 33〕

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Semigroup with involution」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.